Permutations Richard
نویسنده
چکیده
Permutations of finite sets play a central role in algebraic and enumerative combinatorics. In addition to having many interesting enumerative properties per se, permutations also arise in almost every area of mathematics and indeed in all the sciences. Here we will discuss three different topics involving permutations, focusing on combinatorics but also giving some hints about connections with other areas.
منابع مشابه
A New Record for 1324-avoiding Permutations
We prove that the class of 1324-avoiding permutations has exponential growth rate at most 13.74. To Richard Stanley, on the occasion of his seventieth birthday.
متن کاملTransitive factorizations of permutations and geometry
We give an account of our work on transitive factorizations of permutations. The work has had impact upon other areas of mathematics such as the enumeration of graph embeddings, random matrices, branched covers, and the moduli spaces of curves. Aspects of these seemingly unrelated areas are seen to be related in a unifying view from the perspective of algebraic combinatorics. At several points ...
متن کاملA Stream Cipher Based on Chaotic Permutations
In this paper we introduce a word-based stream cipher consisting of a chaotic part operating as a chaotic permutation and a linear part, both of which designed on a finite field. We will show that this system can operate in both synchronized and self-synchronized modes. More specifically, we show that in the self-synchronized mode the stream cipher has a receiver operating as an unknown input o...
متن کاملA Survey of Alternating Permutations
A permutation a1a2 · · · an of 1, 2, . . . , n is alternating if a1 > a2 < a3 > a4 < · · · . We survey some aspects of the theory of alternating permutations, beginning with the famous result of André that if En is the number of alternating permutations of 1, 2, . . . , n, then P n≥0 En x n n! = sec x + tan x. Topics include refinements and q-analogues of En, various occurrences of En in mathem...
متن کاملSeparation Probabilities for Products of Permutations
We study the mixing properties of permutations obtained as a product of two uniformly random permutations of fixed cycle types. For instance, we give an exact formula for the probability that elements 1, 2, . . . , k are in distinct cycles of the random permutation of {1, 2, . . . , n} obtained as product of two uniformly random n-cycles.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009